Computer-Aided Cryptographic Proofs
نویسندگان
چکیده
EasyCrypt is an automated tool that supports the machinechecked construction and verification of security proofs of cryptographic systems, and that has been used to verify emblematic examples of publickey encryption schemes, digital signature schemes, hash function designs, and block cipher modes of operation. The purpose of this paper is to motivate the role of computer-aided proofs in the broader context of provable security and to illustrate the workings of EasyCrypt through simple introductory examples.
منابع مشابه
Game-based cryptographic reductions
The concept of reduction in Cryptography, and the use of games to prove some definition of security were born as a response to the necessity of rigour in the field, which owes enormous contributions to theoretical mathematics, but is nevertheless applied. Cryptographic proofs are currently long and difficult to verify, making them prone to errors. A line of research in an attempt to make proofs...
متن کاملComputer-Aided Security Proofs for the Working Cryptographer
We present an automated tool for elaborating security proofs of cryptographic systems from proof sketches—compact, formal representations of the essence of a proof as a sequence of games and hints. Proof sketches are checked automatically using off-the-shelf SMT solvers and automated theorem provers, and then compiled into verifiable proofs in the CertiCrypt framework. The tool supports most co...
متن کاملA plausible approach to computer-aided cryptographic proofs
This paper tries to sell a potential approach to making the process of writing and verifying our cryptographic proofs less prone to errors. Specifically, I advocate creating an automated tool to help us with the mundane parts of writing and checking common arguments in our proofs. On a high level, this tool should help us verify that two pieces of code induce the same probability distribution o...
متن کاملComputer-aided proofs in cryptography: an overview
The goal of modern cryptography is to design efficient constructions that simultaneously achieve some desired functionality and provable security against resource-bounded adversaries. Over the years, the realm of cryptography has expanded from basic functionalities such as encryption, decryption and key agreement, to elaborate functionalities such as zero-knowledge protocols, secure multiparty ...
متن کاملYACZK: Yet Another Compiler for Zero-Knowledge
Automatic generation of cryptographic protocols is an emerging field of research which aims to bring complex protocols into practice. In this work we discuss the desired properties of a compiler for automatic generation of zeroknowledge proof of knowledge (ZKPoK) protocols. We evaluate and compare existing approaches with respect to these properties: In particular, it seems to us that the autho...
متن کامل